Borel-piecewise continuous reducibility for uniformization problems
نویسنده
چکیده
We study a fine hierarchy of Borel-piecewise continuous functions, especially, between closed-piecewise continuity and Gδ-piecewise continuity. Our aim is to understand how a priority argument in computability theory is connected to the notion of Gδ-piecewise continuity, and then we utilize this connection to obtain separation results on subclasses of Gδ-piecewise continuous reductions for uniformization problems on setvalued functions with compact graphs. This method is also applicable for separating various non-constructive principles in the Weihrauch lattice.
منابع مشابه
A Wadge hierarchy for second countable spaces
Wadge reducibility provides a rich and nice analysis of Borel sets in Polish zero dimensional spaces. However, outside this framework, reducibility by continuous functions was shown to be ill behaved in many important cases. We define a notion of reducibility for subsets of a second countable T0 topological space based on the notions of admissible representations and relatively continuous relat...
متن کاملWeihrauch-completeness for layerwise computability
Layerwise computability is an effective counterpart to continuous functions that are almosteverywhere defined. This notion was introduced by Hoyrup and Rojas [17]. A function defined on Martin-Löf random inputs is called layerwise computable, if it becomes computable if each input is equipped with some bound on the layer where it passes a fixed universal Martin-Löf test. Interesting examples of...
متن کاملar X iv : 1 30 6 . 12 70 v 1 [ m at h . L O ] 6 J un 2 01 3 UNIVERSAL COUNTABLE BOREL QUASI - ORDERS
In recent years, much work in descriptive set theory has been focused on the Borel complexity of naturally occurring classification problems, in particular, the study of countable Borel equivalence relations and their structure under the quasi-order of Borel reducibility. Following the approach of Louveau and Rosendal for the study of analytic equivalence relations, we study countable Borel qua...
متن کاملSome Applications of the Adams-kechris Technique
We analyze the technique used by Adams and Kechris (2000) to obtain their results about Borel reducibility of countable Borel equivalence relations. Using this technique, we show that every Σ1 equivalence relation is Borel reducible to the Borel bi-reducibility of countable Borel equivalence relations. We also apply the technique to two other classes of essentially uncountable Borel equivalence...
متن کاملMeasure Reducibility of Countable Borel Equivalence Relations
We show that every basis for the countable Borel equivalence relations strictly above E0 under measure reducibility is uncountable, thereby ruling out natural generalizations of the Glimm-Effros dichotomy. We also push many known results concerning the abstract structure of the measure reducibility hierarchy to its base, using arguments substantially simpler than those previously employed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Logical Methods in Computer Science
دوره 12 شماره
صفحات -
تاریخ انتشار 2016